Fleck’s binomial congruence using circulant matrices
نویسنده
چکیده
منابع مشابه
Recent Progress on Congruences Involving Binomial Coefficients
In 1913 A. Fleck proved that if p is a prime, and n > 0 and r are integers then ∑ k≡r (mod p) (n k ) (−1) ≡ 0 ( mod pb(n−1)/(p−1)c ) . Only recently the significance of Fleck’s congruence was realized. It plays a fundamental role in Colmez’ and Wan’s investigation of the ψ-operator related to Fontaine’s theory and p-adic Langlands correspondence. In this talk we give a survey of the recent deve...
متن کاملSpectral norms of circulant-type matrices involving some well-known numbers
In this paper, we investigate spectral norms for circulant-type matrices, including circulant, skewcirculant and g-circulant matrices. The entries are product of binomial coefficients with Fibonacci numbers and Lucas numbers, respectively. We obtain identity estimations for these spectral norms. Employing these approaches, we list some numerical tests to verify our results.
متن کاملAgents Network on a Grid: An Approach with the Set of Circulant Operators
In this work we present some matrix operators named circulant operators and their action on square matrices. This study on square matrices provides new insights into the structure of the space of square matrices. Moreover it can be useful in various fields as in agents networking on Grid or large-scale distributed self-organizing grid systems. Keywords— Pascal matrices, Binomial Recursion, Circ...
متن کاملExtensions of Wilson ’ S Lemma and the Ax
Recently R. M. Wilson used Fleck’s congruence and Weisman’s extension to present a useful lemma on polynomials modulo prime powers, and applied this lemma to reprove the Ax-Katz theorem on solutions of congruences modulo p and deduce various results on codewords in p-ary linear codes with weights. In light of the recent generalizations of Fleck’s congruence given by D. Wan, and D. M. Davis and ...
متن کاملComputation of the q-th roots of circulant matrices
In this paper, we investigate the reduced form of circulant matrices and we show that the problem of computing the q-th roots of a nonsingular circulant matrix A can be reduced to that of computing the q-th roots of two half size matrices B - C and B + C.
متن کامل